Learning to Reach 1 Running head: CONSTRAINING THE MOVEMENT SEARCH SPACE Developmental Science (2000), 3, 67-80 Learning to Reach by Constraining the Movement Search Space

نویسندگان

  • Matthew Schlesinger
  • Domenico Parisi
  • Jonas Langer
چکیده

Trial-and-error learning strategies play a central role in sensorimotor development during early infancy. However, learning to reach by trial-and-error normally requires a slow and laborious search through the space of possible movements. We propose a computational model of reaching based on the notion that early sensorimotor control is driven by the generation of exploratory movements, followed by the selection and maintenance of adaptive movement patterns. We find that instead of exhaustively exploring the full search space of movement patterns, the model exploits several emergent constraints that limit the initial size of the movement search space. These constraints exploit both mechanical and kinematic properties of the reaching task. We relate these results to the development of reaching during infancy, and discuss recent findings that have identified similar constraints in young infants.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Teaching-Learning-Based Optimization and Harmony Search for Optimum Design of Space Trusses

The Teaching-Learning-Based Optimization (TLBO) algorithm is a new meta-heuristic algorithm which recently received more attention in various fields of science. The TLBO algorithm divided into two phases: Teacher phase and student phase; In the first phase a teacher tries to teach the student to improve the class level, then in the second phase, students increase their level by interacting amon...

متن کامل

A Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses

In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...

متن کامل

OPTIMAL DESIGN OF STEEL MOMENT FRAME STRUCTURES USING THE GA-BASED REDUCED SEARCH SPACE (GA-RSS) TECHNIQUE

This paper proposes a GA-based reduced search space technique (GA-RSS) for the optimal design of steel moment frames. It tries to reduce the computation time by focusing the search around the boundaries of the constraints, using a ranking-based constraint handling to enhance the efficiency of the algorithm. This attempt to reduce the search space is due to the fact that in most optimization pro...

متن کامل

Guiding Constructive Induction for Incremental Learning from Examples

LAIR is a system that incrementally learns conjunctive concept descriptions from positive and negative examples. These concept descriptions are used to create and extend a domain theory that is applied, by means of constructive induction, to later learning tasks. Important issues for constructive induction are when to do it and how to control it LA IR demonstrates how constructive induction can...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000